The robust network loading problem with dynamic routing
نویسندگان
چکیده
منابع مشابه
The robust network loading problem with dynamic routing
The Robust Network Loading Problem (RNL) can be stated as follows. Given a graph and a set of traffic matrices, install minimum cost integer capacities on the edges such that all the matrices can be routed non simultaneously on the network. The routing scheme is said to be dynamic if we can choose a (possibly) different routing for every matrix, it is called static if the routing must be the sa...
متن کاملRobust Metric Inequalities for the Γ-Robust Network Loading Problem
In this paper, we consider the network loading problem under demand uncertainties with static routing, i.e, a single routing scheme based on the fraction of the demands has to be determined. We generalize the class of metric inequalities to the Γ-robust setting and show that they yield a formulation in the capacity space. We describe a polynomial time exact algorithm to separate violated robust...
متن کاملA hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملEfficient approaches for the robust network loading problem
We consider the Robust Network Loading problem with splittable flows and demands that belong to the budgeted uncertainty set. Four routing schemes are investigated: static, volume, affine and dynamic. First, following what done for static and dynamic routing, we derive capacity formulation for affine and volume routing. This is done using a Benders reformulation approach. Then, we introduce the...
متن کاملAffine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
Affinely-Adjustable Robust Counterparts provide tractable alternatives to (two-stage) robust programs with arbitrary recourse. We apply them to robust network design with polyhedral demand uncertainty, introducing the affine routing principle. We compare the affine routing to the well-studied static and dynamic routing schemes for robust network design. All three schemes are embedded into the g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2012
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-012-9500-0